Isomorphisms of Additive Cellular Automata on Finite Groups
نویسندگان
چکیده
We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such as the index-group, monoid of automata rules, and its subgroup of reversible elements). However for some groups there exist not regular automata isomorphisms. A complete description of linear automorphisms of the monoid is obtained. These automorphisms cover the most part of all automata isomorphisms for small groups and are represented by reversible matrices M such that for any index-group circulant C the matrixM−1CM is an index-group circulant. Subj-class: nlin. CG MSC-class: 37B15, 68Q80
منابع مشابه
The Evolution Homomorphism and Permutation Actions on Group Generated Cellular Automata
In this paper cellular automata generated over group alphabets are examined. For abelian groups and numerous local update rules, time evolution is additive and properties such as reversibility of systems can be examined using algebraic techniques. In particular, a necessary and sufficient condition for the reversibility of a finite one-dimensional cellular automata generated over a finite cycli...
متن کاملChebyshev polynomials over finite fields and reversibility of -automata on square grids
Using number theory on function fields and algebraic number fields we prove results about Chebyshev polynomials over finite prime fields to investigate reversibility of two-dimensional additive cellular automata on finite square grids. For example, we show that there are infinitely many primitive irreversible additive cellular automata on square grids when the base field has order two or three.
متن کاملReduction of behavior of additive cellular automata on groups
A class of additive cellular automata (ACA) on a finite group is defined by an index-group g and a finite field Fp for a prime modulus p [1]. This paper deals mainly with ACA on infinite commutative groups and direct products of them with some non commutative p-groups. It appears that for all abelian groups, the rules and initial states with finite supports define behaviors which being restrict...
متن کاملOn the Measure Entropy of Additive Cellular Automata f∞
We show that for an additive one-dimensional cellular automata on space of all doubly infinitive sequences with values in a finite set S = {0, 1, 2, ..., r-1}, determined by an additive automaton rule f(x ∞ f n-k, ..., xn+k) = (mod r), and a -invariant uniform Bernoulli measure μ, the measure-theoretic entropy of the additive one-dimensional cellular automata with respect to μ is equal to h ∑ −...
متن کاملEnumeration of Number-Conserving Cellular Automata Rules with Two Inputs
Cellular automata (CA) rules possessing additive invariants have been studied since early 90’s. The simplest form of an additive invariant is the sum of all site values over a finite lattice with periodic boundary conditions. Rules with such an invariant are known as number-conserving rules, and they exhibit many interesting properties. For example, they can be viewed as systems of interacting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008